Fuss - Catalan Numbers in Noncommutative Probability

نویسنده

  • Friedrich Götze
چکیده

We prove that if p, r ∈ R, p ≥ 1 and 0 ≤ r ≤ p then the Fuss-Catalan sequence ( mp+r m ) r mp+r is positive definite. We study the family of the corresponding probability measures μ(p, r) on R from the point of view of noncommutative probability. For example, we prove that if 0 ≤ 2r ≤ p and r + 1 ≤ p then μ(p, r) is ⊞-infinitely divisible. As a by-product, we show that the sequence m m m! is positive definite and the corresponding probability measure is ⊠-infinitely divisible. 2010 Mathematics Subject Classification: Primary 46L54; Secondary 44A60, 60C05

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some Properties of the Fuss–catalan Numbers

In the paper, the authors express the Fuss–Catalan numbers as several forms in terms of the Catalan–Qi function, find some analytic properties, including the monotonicity, logarithmic convexity, complete monotonicity, and minimality, of the Fuss–Catalan numbers, and derive a double inequality for bounding the Fuss–Catalan numbers.

متن کامل

Product of Ginibre matrices: Fuss-Catalan and Raney distributions.

Squared singular values of a product of s square random Ginibre matrices are asymptotically characterized by probability distributions P(s)(x), such that their moments are equal to the Fuss-Catalan numbers of order s. We find a representation of the Fuss-Catalan distributions P(s)(x) in terms of a combination of s hypergeometric functions of the type (s)F(s-1). The explicit formula derived here...

متن کامل

Enumeration of non-crossing pairings on bit strings

A non-crossing pairing on a bitstring matches 1s and 0s in a manner such that the pairing diagram is nonintersecting. By considering such pairings on arbitrary bitstrings 1101 . . . 1r0r , we generalize classical problems from the theory of Catalan structures. In particular, it is very difficult to find useful explicit formulas for the enumeration function φ(n1, m1, . . . , nr, mr), which count...

متن کامل

Multivariate Fuss-Catalan numbers

are integers that appear in many combinatorial problems. These numbers first arose in the work of Catalan as the number of triangulations of a polygon by mean of nonintersecting diagonals. Stanley [13, 14] maintains a dynamic list of exercises related to Catalan numbers, including (at this date) 127 combinatorial interpretations. Closely related to Catalan numbers are ballot numbers. Their name...

متن کامل

Catalan Numbers for Complex Reflection Groups

We construct (q, t)-Catalan polynomials and q-Fuss-Catalan polynomials for any irreducible complex reflection group W . The two main ingredients in this construction are Rouquier’s formulation of shift functors for the rational Cherednik algebras of W , and Opdam’s analysis of permutations of the irreducible representations of W arising from the Knizhnik-Zamolodchikov connection.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010